Proof nets, garbage, and computations

Proof Nets, Garbage, and Computations

We study the problem of local and asynchronous computation in the context of multiplicative exponential linear logic (MELL) proof nets. The main novelty is in a complete set of rewriting rules for cut-elimination in presence of weakening (which requires garbage collection). The proposed reduction system is strongly normalizing and confluent. Abstract: We study the problem of local and asynchron...

Proof nets , Garbage , and Computations 1

Stefano Guerrini a Simone Martini c Andrea Masini b aDipartimento di Scienze dell’Informazione Università di Roma ‘La Sapienza’ Via Salaria, 113 I-00198, Roma, Italy email: [email protected] bDipartimento di Matematica, Università di Trento Via Sommarive 14 I-38050, Trento, Italy email: [email protected] cDipartimento di Matematica e Informatica, Università di Udine Via delle Scien...

Institute for Research in Cognitive Science Proof nets , Garbage , and Computations

Polarized Proof-Nets: Proof-Nets for LC

We deene a notion of polarization in linear logic (LL) coming from the polarities of Jean-Yves Girard's classical sequent calculus LC 4]. This allows us to deene a translation between the two systems. Then we study the application of this polarization constraint to proof-nets for full linear logic described in 7]. This yields an important simpli-cation of the correctness criterion for polarized...

L-Nets, Strategies and Proof-Nets

We consider the setting of L-nets, recently introduced by Faggian and Maurel as a game model of concurrent interaction and based on Girard’s Ludics. We show how L-nets satisfying an additional condition, which we call logical L-nets, can be sequentialized into traditional tree-like strategies, and vice-versa.